Penerapan Algoritma Hash Based dalam Penemuan Aturan Asosiasi Penjualan Tanaman Hias
نویسندگان
چکیده
Technology is very influential in the world of increasingly fierce business competition so that people must find strategies to increase sales results midst competition. Ornamental plant sellers be smart managing stock and making selling ornamental plants. Transaction data can processed into information needed results, one which used as an analysis rules buyer transaction association purchasing plants it support decision on supplies assist officers recommending other buyers a cross strategy. Knowing are often purchased will top priority provided there no shortage. In this case, mining manage for at Sindy Flower Shop using Hash Based algorithm. Algorithm optimally determine frequent itemset candidate itemset. its application determining associations by applying algorithm obtain itemsets 3-itemset Dahlia, Empasen Melati combination prioritized with value 25% confidence 60%
منابع مشابه
An Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Security Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملImproving Stateless Hash-Based Signatures
We present several optimizations to SPHINCS, a stateless hash-based signature scheme proposed by Bernstein et al. in 2015: PORS, a more secure variant of the HORS few-time signature scheme used in SPHINCS; secret key caching, to speed-up signing and reduce signature size; batch signing, to amortize signature time and reduce signature size when signing multiple messages at once; mask-less constr...
متن کاملHash-Based Structural Join Algorithms
Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many requirements, e. g., guarantee linear worst-case runtime; generate sorted, duplicate-free output; adapt to fiercely varying input sizes and element distributions; enable pipelining; and (probably) more. Therefore, it is not pos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Building of Informatics, Technology and Science (BITS)
سال: 2022
ISSN: ['2684-8910', '2685-3310']
DOI: https://doi.org/10.47065/bits.v4i3.2626